Edited nearest neighbour for selecting keyframe summaries of egocentric videos
نویسندگان
چکیده
منابع مشابه
k-Nearest Neighbour Classifiers
Perhaps the most straightforward classifier in the arsenal or machine learning techniques is the Nearest Neighbour Classifier – classification is achieved by identifying the nearest neighbours to a query example and using those neighbours to determine the class of the query. This approach to classification is of particular importance today because issues of poor run-time performance is not such...
متن کاملEnhanced Nearest Neighbour
Multimedia databases usually deal with huge amounts of data and it is necessary to have an indexing structure such that eecient retrieval of data can be provided. R-Tree with its variations, is a commonly cited indexing method. In this paper we propose an improved nearest neighbor search algorithm on the R-tree and its variants. The improvement lies in the removal of two hueristics that have be...
متن کاملNearest Neighbour Search for Visualization Using Arbitrary Triangulations Nearest Neighbour Search for Visualization Using Arbitrary Triangulations
In visualization of scattered data, one is often faced with the problem of nding the nearest neighbours of a data site. This task frequently occurs in an advanced stage of the visualization process, where several data structures have been created during run time. Many applications compute a triangulation of the data for their visualization purposes. To take advantage of this previously allocate...
متن کاملBatch based Monocular SLAM for Egocentric Videos
Simultaneous Localization and Mapping (SLAM) from a monocular camera has been a well researched area. However, estimating camera pose and 3d geometry reliably for egocentric videos still remain a challenge [25, 40, 42]. Some of the common causes of failures are dominant 3D rotations and low parallax between successive frames, resulting in unreliable pose and 3d estimates. For forward moving cam...
متن کاملNearest Neighbour Strategies for Image Understanding
Nearest Neighbour algorithms for pattern recognition have been widely studied. It is now well-established that they offer a quick and reliable method of data classification. In this paper we further develop the basic definition of the standard k-nearest neighbour algorithm to include the ability to resolve conflicts when the highest number of nearest neighbours are found for more than one train...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Visual Communication and Image Representation
سال: 2018
ISSN: 1047-3203
DOI: 10.1016/j.jvcir.2018.02.010